bsp_node *find_node(bsp_node *n,vector& v,float mindist)
| Parameter | Type | Description |
|---|---|---|
| n | bsp_node * | bsp root node |
| v | vector& | point in world co-ordinates |
| mindist | float | minimum distance |
Returns the bsp leaf the point v is in.
This function finds the leaf node for a given point. If the point distance to any plane is less than mindist, then the leaf is rejected.